منابع مشابه
Supporting Contexts in Program Reenement Note: Most Svrc Technical Reports Are Available Supporting Contexts in Program Reenement
A program can be reened either by transforming the whole program or by reening one of its components. The reenement of a component is, for the main part, independent of the remainder of the program. However, reenement of a component can depend on the context of the component for information about the variables that are in scope and what their types are. The reenement can also take advantage of ...
متن کاملRefinement and Separation Contexts
A separation context is a client program which does not dereference internals of the module with which it interacts. We use precise relations to unambiguously describe the storage of the module. We prove that separation contexts preserve such relations, as well as interesting properties of separation contexts in connection with refinement.
متن کاملA Program Refinement Framework Supporting Reasoning about Knowledge and Time
This paper develops a highly expressive semantic framework for program refinement that supports both temporal reasoning and reasoning about the knowledge of a single agent. The framework generalizes a previously developed temporal refinement framework by amalgamating it with a logic of quantified local propositions, a generalization of the logic of knowledge. The combined framework provides a f...
متن کاملSupporting Contexts for Indoor Navigation
Indoor navigation highly depends on context and requires flexible data structures to support the many use cases and configurations. For example, an indoor navigation system must cope with different localisation techniques, infrastructures, and capabilities of mobile devices. Also physical constraints from the built-up environment, different modes of navigation (like walking, driving, or flying)...
متن کاملProgram equivalence in linear contexts
Program equivalence in linear contexts, where programs are used or executed exactly once, is an important issue in programming languages. However, existing techniques like those based on bisimulations and logical relations only target at contextual equivalence in the usual (non-linear) functional languages, and fail in capturing non-trivial equivalent programs in linear contexts, particularly w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 1997
ISSN: 0167-6423
DOI: 10.1016/s0167-6423(97)00002-6